Resource-Constrained Software Pipelining
نویسندگان
چکیده
This paper presents a software pipelining algorithm for the automatic extraction of ne-grain parallelism in general loops. The algorithm accounts for machine resource constraints in a way that smoothly integrates the management of resource constraints with software pipelining. Furthermore, generality in the software pipelining algorithm is not sacriiced to handle resource constraints, and scheduling choices are made with truly global information. Proofs of correctness and the results of experiments with an implementation are also presented.
منابع مشابه
Unret: a Transformation-based Technique for Software Pipelining with Resource Constraints Unret: a Transformation-based Technique for Software Pipelining with Resource Constraints
This paper presents UNRET (unrolling and retiming), a new approach for resource-constrained software pipelining. UNRET aims at nding a loop schedule with maximum resource usage. UNRET explores schedules in decreasing order of resource usage. For each theoretical resource usage, both the unrolling degree of the loop (K) and the initiation interval of the schedule (II) are analitically computed b...
متن کاملResource-constrained pipelining based on loop transformations
In this paper a novel technique for resource-constrained loop pipelining is presented. RCLP is based on several dependence graph operations: loop unrolling, operation retiming, resource-constrained scheduling, and span reduction. All these operations are focused to nd a minimum length schedule able to be executed with a limited number of resources and thus maximizing resource utilization. The r...
متن کاملRclp: a Novel Approach for Resource-constrained Loop Pipelining Rclp:a Novel Approach for Resource-constrained Loop Pipelining 3
In this paper a novel technique for resource-constrained loop pipelining is presented. RCLP is based on several dependence graph operations: loop unrolling, operation retiming, resource-constrained scheduling, and span reduction. All these operations are focused to nd a minimum length schedule able to be executed with a limited number of resources and thus maximizing resource utilization. Exper...
متن کاملWorst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays
In this paper we adress a new cyclic problem: finding periodic schedules for unitary resource constrained cyclic scheduling problem. Such resource constraints are characterized by k, the number of types of functional units employed and mx the maximal number of processors of the same type. The main problem is to cope with both precedence delays and resources which make the problem NP-complete in...
متن کاملResource Directed Loop Pipelining: Exposing Just Enough Parallelism
Many techniques have been proposed for exploiting instruction-level parallelism, ranging from the optimal and expensive but ignoring resource constraints, to various forms of introducing resource constraints. One of the most aggressive of these techniques is resource-constrained software pipelining (RCSP). RCSP works by repeatedly scheduling successive iterations of a loop in parallel until the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Parallel Distrib. Syst.
دوره 6 شماره
صفحات -
تاریخ انتشار 1995